Capacity approaching codes for photon counting receivers

نویسندگان

  • Marina Mondin
  • Fred Daneshgaran
  • Inam Bari
  • Maria Teresa Delgado
چکیده

In [1] a low-complexity photon-counting receiver has been presented, which may be employed for weak-energy optical communications and which is typically modeled through its equivalent Binary Symmetric Channel (BSC) model. In this paper we consider the scheme described in [1], we model it as a time varying Binary Input-Multiple Output (BIMO) channel and analyze its performance in presence of soft-metric based capacity approaching iteratively decoded error correcting codes, and in particular using soft-metric based Low Density Parity Check (LDPC) codes. To take full advantage of such detector, soft information is generated in the form of Log-Likelihood Ratios (LLRs), achieving reduction in Bit Error Rate (BER) and Frame Error Rate (FER) with respect to classical BSC and Additive White Gaussian Noise (AWGN) channel models. Furthermore, we explore the limits of the achievable performance gains when using photon counting detectors as compared to the case when such detectors are not available. To this end, we find the classical capacity of the considered BIMO channel, clearly showing the potential gains that photon counting detectors can provide in the context of a realistic cost-effective scheme from an implementation point of view. Furthermore, we show that from a channel modeling point of view, we can observe that the BIMO channel can be approximated with an AWGN channel for high values of mean photon count Nc, while the AWGN model offers an unreliable result with a low mean photon number Nc, (i.e. with low raw BER). This effect is more evident with lower coding rates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-Efficiency Error Correction for Photon Counting

Today's data-driven society demands high data rates and high-rate communication links. Addressing these needs in everything from gigabit Ethernet network connections and telephone or cable television signals to communication between spacecraft can require high bandwidth, high power, large transmit or receive apertures or both, and high receiver sensitivity. Optical communication is attractive f...

متن کامل

Structured optical receivers to attain superadditive capacity and the Holevo limit

Attaining the ultimate (Holevo) limit to the classical capacity of a quantum channel requires the receiver to make joint measurements over long code-word blocks. For a pure-state channel, we show that the Holevo limit can be attained by a receiver that uses a multisymbol unitary transformation on the quantum code word followed by separable projective measurements. We show a concatenated coding ...

متن کامل

Practical codes for photon communication

In a recent paper, Pierce studied the problems of communicating at optical frequencies using photon-counting techniques, and concluded that “at low temperatures we encounter insuperable problems of encoding long before we approach [channel capacity].” In this paper it is shown that even assuming a noiseless model for photon communication for which capacity (measured in nats/photon) is infinite,...

متن کامل

Statistical connection of binomial photon counting and photon averaging in high dynamic range beam-scanning microscopy

Data from photomultiplier tubes are typically analyzed using either counting or averaging techniques, which are most accurate in the dim and bright signal limits, respectively. A statistical means of adjoining these two techniques is presented by recovering the Poisson parameter from averaged data and relating it to the statistics of binomial counting from Kissick et al. [Anal. Chem. 82, 10129 ...

متن کامل

Capacity Approaching Codes , Iterative Decoding Algorithms , and Their Applications

Implementation constraints on iterative decoders applying message-passing algorithms are investigated. Serial implementations similar to traditional microprocessor datapaths are compared against architectures with multiple processing elements that exploit the inherent parallelism in the decoding algorithm. Turbo codes and low-density parity check codes, in particular, are evaluated in terms of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012